A Broadcasting Algorithm with Time and Message Optimum on Arrangement Graphs
نویسندگان
چکیده
منابع مشابه
A Broadcasting Algorithm with Time and Message Optimum on Arrangement Graphs
In this paper, we propose a distributed broadcasting algorithm with optimal time complexity and without message redundancy for one-toall broadcasting in the one-port communication model on arrangement graph interconnection networks. The algorithm exploits the hierarchical property of the arrangement graph to construct different-sized broadcasting trees for different-sized subgraphs. These diffe...
متن کاملAn Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs
Based on the Mendia and Sarkar's algorithm [8], we propose an optimal and nonredundant distributed broadcasting algorithm in star graphs. For an n-dimensional star graph, our algorithm takes O( n log, n ) time and guarantees that all nodes in the star graph receive the message exactly once. Moreover, broadcasting m packets in a pipeline fashion takes O( m log, n + n log, n ) time due to the non...
متن کاملA Message Passing Implementation of a New Parallel Arrangement Algorithm
This paper describes a new algorithm of arrangement in parallel, based on Odd-Even Mergesort, called division and concurrent mixes. The main idea of the algorithm is to achieve that each processor uses a sequential algorithm for ordering a part of the vector, and after that, for making the processors work in pairs in order to mix two of these sections ordered in a greater one, also ordered; aft...
متن کاملFault-Tolerant Broadcasting on the Arrangement Graph
This paper proposes a distributed fault-tolerant algorithm for one-to-all broadcasting in the oneport communication model on the arrangement graph. Exploiting the hierarchical properties of the arrangement graph to constitute different-sized broadcasting trees for different-sized subgraphs, we propose a distributed algorithm with optimal time complexity and without message redundancy for one-to...
متن کاملBroadcasting on cactus graphs
Broadcasting is the process of dissemination of a message from one vertex (called originator) to all other vertices in the graph. This task is accomplished by placing a sequence of calls between neighboring vertices, where one call requires one unit of time and each call involves exactly two vertices. Each vertex can participate in one call per one unit of time. Determination of the broadcast t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Algorithms and Applications
سال: 1998
ISSN: 1526-1719
DOI: 10.7155/jgaa.00005